Multiparty communication complexity and very hard functions
نویسندگان
چکیده
منابع مشابه
Multiparty communication complexity and very hard functions
A boolean function f(x1, . . . , xn) with xi ∈ {0, 1}m for each i is hard if its nondeterministic multiparty communication complexity (introduced in [in: Proceedings of the 30th IEEE FOCS, 1989, p. 428–433]), C(f), is at least nm. Note that C(f) nm for each f(x1, . . . , xn) with xi ∈ {0, 1}m for each i. A boolean function is very hard if it is hard and its complementary function is also hard. ...
متن کاملMultiparty Communication Complexity: Very Hard Functions
We consider the multiparty communication model deened in DF89] using the formalism from Hr97]. First, we correct an inaccuracy in the proof of the fundamental result of DR95] providing a lower bound on the nondeter-ministic communication complexity of a function. Then we construct several very hard functions, i.e., functions such that those as well as their complements have the worst possible n...
متن کاملConstruction of very hard functions for multiparty communication complexity
We consider the multiparty communication model deened in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lower bound on the nondeterministic communication complexity of a function. Then we construct several very hard functions, i.e., functions such that those as well as their complements have the worst possible nonde-termi...
متن کاملSimultaneous Multiparty Communication Complexity of Composed Functions
The Number On the Forehead (NOF) model is a multiparty communication game between k players that collaboratively want to evaluate a given function F : X1 × · · · ×Xk → Y on some input (x1, . . . , xk) by broadcasting bits according to a predetermined protocol. The input is distributed in such a way that each player i sees all of it except xi (as if xi is written on the forehead of player i). In...
متن کاملThere are no zero-hard problems in multiparty communication complexity
We study the feasibility of generalizing the notions of completeness and hardness in 2-party communication complexity (Babai, Frankl, Simon, FOCS 1986) to the “number-on-forehead” (NOF) model of k-party communication complexity with k ≥ 3 (Chandra, Furst, Lipton, STOC 1983). Beame et al. (Theory of Computing, 2010) suggest that the kparty version of NP may not have any complete families under t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2004
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.03.002